Behavioral Metrics via Functor Lifting
نویسندگان
چکیده
We study behavioral metrics in an abstract coalgebraic setting. Given a coalgebra α : X → FX in Set, where the functor F specifies the branching type, we define a framework for deriving pseudometrics on X which measure the behavioral distance of states. A first crucial step is the lifting of the functor F on Set to a functor F in the category PMet of pseudometric spaces. We present two different approaches which can be viewed as generalizations of the Kantorovich and Wasserstein pseudometrics for probability measures. We show that the pseudometrics provided by the two approaches coincide on several natural examples, but in general they differ. Then a final coalgebra for F in Set can be endowed with a behavioral distance resulting as the smallest solution of a fixed-point equation, yielding the final F -coalgebra in PMet. The same technique, applied to an arbitrary coalgebra α : X → FX in Set, provides the behavioral distance on X. Under some constraints we can prove that two states are at distance 0 if and only if they are behaviorally equivalent. 1998 ACM Subject Classification F.3.1 Specifying and Verifying and Reasoning about Programs, D.2.4 Software/Program Verification
منابع مشابه
Coalgebraic Behavioral Metrics
We study different behavioral metrics, such as those arising from both branching and linear-time semantics, in a coalgebraic setting. Given a coalgebra $\alpha\colon X \to HX$ for a functor $H \colon \mathrm{Set}\to \mathrm{Set}$, we define a framework for deriving pseudometrics on $X$ which measure the behavioral distance of states. A crucial step is the lifting of the functor $H$ on $\mathrm{...
متن کاملTowards Trace Metrics via Functor Lifting
We investigate the possibility of deriving metric trace semantics in a coalgebraic framework. First, we generalize a technique for systematically lifting functors from the category Set of sets to the category PMet of pseudometric spaces, by identifying conditions under which also natural transformations, monads and distributive laws can be lifted. By exploiting some recent work on an abstract d...
متن کاملLax Extensions of Coalgebra Functors
We discuss the use of relation lifting in the theory of setbased coalgebra. On the one hand we prove that the neighborhood functor does not extend to a relation lifting of which the associated notion of bisimilarity coincides with behavorial equivalence. On the other hand we argue that relation liftings may be of use for many other functors that do not preserve weak pullbacks, such as the monot...
متن کاملLax extensions of coalgebra functors and their logic
We discuss the use of relation lifting in the theory of set-based coalgebra and coalgebraic logic. On the one hand we prove that the neighborhood functor does not extend to a relation lifting of which the associated notion of bisimilarity coincides with behavioral equivalence. On the other hand we argue that relation liftings may be of use for many other functors that do not preserve weak pullb...
متن کاملA Sound and complete axiomatisations of coalgebraic language equivalence
Coalgebras provide a uniform framework to study dynamical systems, including several types of automata. In this paper, we make use of the coalgebraic view on systems to investigate, in a uniform way, under which conditions calculi that are sound and complete with respect to behavioral equivalence can be extended to a coarser coalgebraic language equivalence, which arises from a generalised powe...
متن کامل